Cardinality Bounds for Triangulations with Bounded Minimum Angle
نویسنده
چکیده
We consider bounding the cardinality of an arbitrary triangulation with smallest angle We show that if the local feature size i e distance between disjoint vertices or edges of the triangulation is within a con stant factor of the local feature size of the input then N O M where N is the cardinality of the triangulation and M is the cardinality of any other triangulation with smallest angle at least Previ ous results had an O dependence Our O dependence is tight for input with a large length to height ratio in which triangles may be ori ented along the long dimension
منابع مشابه
An anisotropic cardinality bound for triangulations
A bound on the cardinality of planar triangulations with minimum angle is considered. It is shown that a certain integral over the edges of the triangulation is bounded by times the number of vertices. This is an alteration of a result by Mitchell [6], and allows an optimality bound on triangulations which are “well-graded” to the local feature size of an input domain [7]. In particular, this r...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملLMT-skeleton heuristics for several new classes of optimal triangulations
Given a planar point set, we consider three classes of optimal triangulations: (1) the minimum weight triangulation with angular constraints (constraints on the minimum angle and the maximum angle in a triangulation), (2) the angular balanced triangulation which minimizes the sum of the ratios of the maximum angle to the minimum angle for each triangle and (3) the area balanced triangulation wh...
متن کاملStabbing Line Segments with Disks: Complexity and Approximation Algorithms
Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straight line drawing of planar graph. This problem along with its relatives [3] arise in physical network security analysis for telecommunication, wireless and road networks represented by geometric graphs ...
متن کامل